Planning Through Stochastic Local Search and Temporal Action Graphs in LPG

نویسندگان

  • Alfonso Gerevini
  • Alessandro Saetti
  • Ivan Serina
چکیده

We present some techniques for planning in domains specified with the recent standard language pddl2.1, supporting “durative actions” and numerical quantities. These techniques are implemented in lpg, a domain-independent planner that took part in the 3rd International Planning Competition (IPC). lpg is an incremental, any time system producing multi-criteria quality plans. The core of the system is based on a stochastic local search method and on a graph-based representation called “Temporal Action Graphs” (TAgraphs). This paper focuses on temporal planning, introducing TA-graphs and proposing some techniques to guide the search in lpg using this representation. The experimental results of the 3rd IPC, as well as further results presented in this paper, show that our techniques can be very effective. Often lpg outperforms all other fully-automated planners of the 3rd IPC in terms of speed to derive a solution, or quality of the solutions that can be produced.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Local Search Techniques for Temporal Planning in LPG

We present some techniques for planning in temporal domains specified with the recent standard languange PDDL2.1. These techniques are implemented in LPG, a fully-automated system that took part in the third International Planning Competition (Toulouse, 2002) showing excellent performance. The planner is based on a stochastic local search method and on a graph-based representation called “Tempo...

متن کامل

Temporal Planning with Problems Requiring Concurrency through Action Graphs and Local Search

We present an extension of the planning framework based on action graphs and local search to deal with PDDL2.1 temporal problems requiring concurrency, while previously the approach could only solve problems admitting a sequential solution. The paper introduces a revised plan representation supporting concurrency and some new search techniques using it, which are implemented in a new version of...

متن کامل

LPG-TD: a Fully Automated Planner for PDDL2.2 Domains

Like the previous version of LPG, the new version is based on a stochastic local search in the space of particular “action graphs” derived from the planning problem specification. In LPG-TD, this graph representation has been extended to deal with the new features of PDDL2.2, as well to improve the management of durative actions and of numerical expressions (already supported by PDDL2.1 (Fox & ...

متن کامل

LPG: A Planner Based on Local Search for Planning Graphs with Action Costs

We present LPG, a fast planner using local search for solving planning graphs. LPG can use various heuristics based on a parametrized objective function. These parameters weight different types of inconsistencies in the partial plan represented by the current search state, and are dynamically evaluated during search using Lagrange multipliers. LPG’s basic heuristic was inspired by Walksat, whic...

متن کامل

Planning with Numerical Expressions in LPG

We present some techniques for handling planning problems with numerical expressions that can be specified using the standard planning language PDDL. These techniques are implemented in LPG, a fully-automated planner based on local search that was awarded at the third international planning competition (2002). First, we present a plan representation for handling numerical expressions called Num...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Artif. Intell. Res.

دوره 20  شماره 

صفحات  -

تاریخ انتشار 2003